Low-Rank Quantum State Preparation
نویسندگان
چکیده
Ubiquitous in quantum computing is the step to encode data into a state. This process called state preparation, and its complexity for non-structured exponential on number of qubits. Several works address this problem, instance, by using variational methods that train fixed depth circuit with manageable complexity. These have their limitations, as lack back-propagation technique barren plateaus. work proposes an algorithm reduce preparation offloading computational classical computer. The initialized can be exact or approximation, we show approximation better today’s processors than initialization original Experimental evaluation demonstrates proposed method enables more efficient probability distributions
منابع مشابه
Low-entanglement remote state preparation.
An outer bound on the low-entanglement remote state preparation ebits vs bits tradeoff curve [Bennett et al., quant-ph/0006044, 2000] is found using techniques of classical information theory. We show this bound to be optimal among an important class of protocols and conjecture optimality even without this restriction.
متن کاملQuantum Gate and Quantum State Preparation through Neighboring Optimal Control
Title of dissertation: QUANTUM GATE AND QUANTUM STATE PREPARATION THROUGH NEIGHBORING OPTIMAL CONTROL Yuchen Peng, Doctor of Philosophy, 2016 Dissertation directed by: Dr. Frank Gaitan Laboratory for Physical Sciences Professor Victor Yakovenko Department of Physics Successful implementation of fault-tolerant quantum computation on a system of qubits places severe demands on the hardware used t...
متن کاملAlgebraic-geometric separability criterion and low rank mixed state entanglement
We first propose a new separability criterion based on algebraicgeometric invariants of bipartite mixed states introduced in [1], then prove that for all low ranks r ≤ m+n−3, generic rank r mixed states in H A ⊗ H B have realtively high Schmidt numbers by this separability criterion (thus entangled). This also means that the algebraicgeometric separability criterion prposed here can be used to ...
متن کاملState Compression of Markov Processes via Empirical Low-Rank Estimation
Model reduction is a central problem in analyzing complex systems and highdimensional data. We study the state compression of finite-state Markov process from its empirical trajectories. We adopt a low-rank model which is motivated by the state aggregation of controlled systems. A spectral method is proposed for estimating the frequency and transition matrices, estimating the compressed state s...
متن کاملLow-Rank Hidden State Embeddings for Viterbi Sequence Labeling
In textual information extraction and other sequence labeling tasks it is now common to use recurrent neural networks (such as LSTM) to form rich embedded representations of long-term input co-occurrence patterns. Representation of output co-occurrence patterns is typically limited to a hand-designed graphical model, such as a linear-chain CRF representing short-term Markov dependencies among s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2023
ISSN: ['1937-4151', '0278-0070']
DOI: https://doi.org/10.1109/tcad.2023.3297972